Searching an Appropriate Journal for your Paper - an Approach Inspired by Expert Search and Data Fusion
نویسندگان
چکیده
On an abstract level, one is often confronted with some type of classification problem where we have one example instance or a textual query and we are looking for the class most appropriate for this instance or query. More concretely, we consider journals as classes and the papers published in certain journals as constituting and describing the respective class. In this scenario two information needs are conceivable: (1) We know one paper and we are looking for all journals which could potentially contain similar work. (2) We want to write a paper, have a first working title, and are looking for journals which could be potential targets for a submission of that paper. In this work, we transfer methods used in expert search and data fusion to find appropriate journals: Using a flat, title based search query for articles we examine voting models used in expertise retrieval with its different data fusion techniques to find and rank journals associated with the matching articles that potentially contain most suitable other articles. To evaluate the ranking of found journals, we remove several test articles from the applied collection and utilize them as request items with their titles. We assume that—on average—the journals where these test articles have been published should be among the top ranked journals to provide a suitable result. This fully automated evaluation provides the opportunity to execute a huge number of requests against the collection of articles and to evaluate the different voting techniques transferred from expert search.
منابع مشابه
Multiresponse surface optimization via Harmony search algorithm (Quality Engineering Conference Paper)
Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...
متن کاملA two phases approach for discriminating efficient candidate by using DEA inspired procedure
There are several methods to ranking DMUs in Data Envelopment Analysis (DEA) and candidates in voting system. This paper proposes a new two phases method based on DEA’s concepts. The first phase presents an aspiration rank for each candidate and second phase propose final ranking.
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملA New Approach to Self-Localization for Mobile Robots Using Sensor Data Fusion
This paper proposes a new approach for calibration of dead reckoning process. Using the well-known UMBmark (University of Michigan Benchmark) is not sufficient for a desirable calibration of dead reckoning. Besides, existing calibration methods usually require explicit measurement of actual motion of the robot. Some recent methods use the smart encoder trailer or long range finder sensors such ...
متن کامل